Search-and-rescue rendezvous

We consider a new type of asymmetric rendezvous search problem in which player II needs to give I ‘gift’ can be the form information or material. The gift either transfered upon meeting, as traditional rendezvous, it dropped off by at location he passes, hope will found I. might water bottle for traveller lost desert; supply cache Captain Scott Antarctic; important (left gift). common aim two players is minimize time taken meet find gift. optimal agent paths and drop times when region line, initial distance between known one both leave gifts. A novel technique introduced this paper use families linear programs solve previous problems. Previously, approach was guess answer then prove optimal. Our work has applications other forms on line: we symmetric version (players must same strategy) with gifts show that there are no solutions problem. also GiftStart problem, where start game. Furthermore, Minmax game objective function maximum time. This admits variations have 0,1 2 disposal. In particular, classical Wait For Mommy strategy setting.